A Detailed Investigation of Memory Requirements for Publish/Subscribe Filtering Algorithms
نویسندگان
چکیده
Various filtering algorithms for publish/subscribe systems have been proposed. One distinguishing characteristic is their internal representation of Boolean subscriptions: They either require conversions into DNFs (canonical approaches) or are directly exploited in event filtering (non-canonical approaches). In this paper, we present a detailed analysis and comparison of the memory requirements of canonical and non-canonical filtering algorithms. This includes a theoretical analysis of space usages as well as a verification of our theoretical results by an evaluation of a practical implementation. This practical analysis also considers time (filter) efficiency, which is the other important quality measure of filtering algorithms. By correlating the results of space and time efficiency, we conclude when to use non-canonical and canonical approaches.
منابع مشابه
Investigating the Memory Requirements for Publish/Subscribe Filtering Algorithms
Various filtering algorithms for publish/subscribe systems have been proposed. One distinguishing characteristic is their internal representation of Boolean subscriptions: They either require conversions to disjunctive normal forms (canonical approaches) or are directly exploited in event filtering (non-canonical approaches). In this paper, we present a detailed analysis and comparison of the m...
متن کاملEfficient matching for state-persistent publish/subscribe systems
Content-based publish/subscribe systems allow information dissemination and fine-grained information filtering in loosely coupled distributed systems. Stateless publish/subscribe systems send notifications to all subscribers whose subscriptions match an incoming publication. Statepersistent publish/subscribe systems, a recently proposed model that stores the states of both publications and subs...
متن کاملTop-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams
Continuous processing of top-k queries over data streams is a promising technique for alleviating the information overload problem as it distinguishes relevant from irrelevant data stream objects with respect to a given scoring function over time. Thus it enables filtering of irrelevant data objects and delivery of top-k objects relevant to user interests in real-time. We propose a solution for...
متن کاملEfficient Distributed Event Processing using Subscription Summaries in Large Scale Publish/Subscribe Systems
A key issue when designing and implementing large-scale publish/subscribe systems is how to efficiently propagate user subscriptions among the brokers of the system. In this paper we contribute the notion of broker subscription summaries and accompanying distributed and scalable algorithms for subscription summary propagation and event filtering and routing. In addition we present a performance...
متن کاملDeployment Optimization for Embedded Flight Avionics Systems
Loosely-coupled publish/subscribe messaging systems facilitate optimized deployment of software applications to hardware processors. Intelligent algorithms can be used to refine system deployments to reduce system cost and resource requirements, such as memory and processor utilization. This article describes how we applied a computerassisted deployment optimization tool to reduce the required ...
متن کامل